Mesh Simplification Algorithms for Rendering Performance
نویسندگان
چکیده
منابع مشابه
Benchmarking Mesh Simplification Algorithms in Real-time Rendering Applications
This paper presents an idea on benchmarking mesh simplification algorithms. Our methodology is that we evaluate and compare mesh simplification algorithms in a standard real-time rendering environment, in which a set of performance measures are defined and various real-time rendering tasks are provided. The performance is measured automatically in this environment while the algorithm performs r...
متن کاملA comparison of mesh simplification algorithms
In many applications the need for an accurate simplification of surface meshes is becoming more and more urgent. This need is not only due to rendering speed reasons, but also to allow fast transmission of 3D models in network-based applications. Many different approaches and algorithms for mesh simplification have been proposed in the last few years. We present a survey and a characterization ...
متن کاملA Short Survey of Mesh Simplification Algorithms
The problem of approximating a given input mesh with a less complex but geometrically faithful representation is well-established in computer graphics. Given the visual complexity required to create realistic-looking scenes, simplification efforts can be essential to efficient rendering. Level-of-detail representations figure prominently in real-time applications such as virtual reality, terrai...
متن کاملCPU-GPU Algorithms for Triangular Surface Mesh Simplification
Mesh simplification and mesh compression are important processes in computer graphics and scientific computing, as such contexts allow for a mesh which takes up less memory than the original mesh. Current simplification and compression algorithms do not take advantage of both the central processing unit (CPU) and the graphics processing unit (GPU). We propose three simplification algorithms, on...
متن کاملDecimating samples for mesh simplification
Modern scanning devices allow to obtain a dense sample of discrete points from the surface of a physical object. A piecewise linear surface interpolating these points is computed to reconstruct the sampled surface. Typically such surfaces have a large combinatorial description since the input is usually too dense. In this paper we present an algorithm to decimate the samples to eliminate oversa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering Research and Technology
سال: 2020
ISSN: 0974-3154
DOI: 10.37624/ijert/13.6.2020.1110-1119